Negotiation Protocols for Distributed Nurse Rostering

نویسندگان

  • Ruben Lagatie
  • Stefaan Haspeslagh
  • Patrick De Causmaecker
چکیده

One intricate computational problem still researched today is the Nurse Rostering Problem. Most literature presents different solutions to the local problem, but in recent years the concept of problem decomposition was identified as one way to improve performance. The downside of this is that the quality of separate rosters is much lower than that of a central solution, where personnel can be scheduled in other wards. Some recent papers introduce negotiation as a way to handle crucial problems such as personnel shortages. This contribution presents a method to use negotiation in solving these problems, but at the same time improve the overall quality. A framework for such a system is presented and five different negotiation protocols are compared.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Framework for negotiation in Distributed Nurse Rostering Problems

This contribution deals with the distributed version of the nurse rostering problem. It is considered in a hospital with many separated wards. The nurse rostering problem within a ward is ‘the local problem’, rosters within a ward are ‘local rosters’. At any time in the process, i.e. at the time of the construction of a roster for a certain time period as well as in the course of this time peri...

متن کامل

Nurse rostering using fuzzy logic: A case study

In this paper, we used the fuzzy set theory for modeling flexible constraints and uncertain data in nurse scheduling problems and proposed a fuzzy linear model for nurse rostering problems. The developed model can produce rosters that satisfy hospital objectives, ward requirements and staff preferences by satisfying their requests as much as possible. Fuzzy sets are used for modeling demands of...

متن کامل

Solving a nurse rostering problem considering nurses preferences by graph theory approach

Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...

متن کامل

A Hyperheuristic Approach to Belgian Nurse Rostering Problems

The nurse rostering problem involves the assignment of shifts to nurses with respect to several constraints like workload, legal restrictions, and contractual agreements [9]. The complexity of the problem attracts many researchers around the world. Since the regulations, requirements, and agreements differ from country to country, the models and solution methods differ as well [9]. The solution...

متن کامل

Hybrid and Cooperative Strategies Using Harmony Search and Artificial Immune Systems for Solving the Nurse Rostering Problem

The nurse rostering problem is an important search problem that features many constraints. In a nurse rostering problem, these constraints are defined by processes such as maintaining work regulations, assigning nurse shifts, and considering nurse preferences. A number of approaches to address these constraints, such as penalty function methods, have been investigated in the literature. We prop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009